The Spectrum of Strong Behavioral Equivalences for Nondeterministic and Probabilistic Processes
نویسندگان
چکیده
We present a spectrum of trace-based, testing, and bisimulation equivalences for nondeterministic and probabilistic processes whose activities are all observable. For every equivalence under study, we examine the discriminating power of three variants stemming from three approaches that differ for the way probabilities of events are compared when nondeterministic choices are resolved via deterministic schedulers. We show that the first approach – which compares two resolutions relatively to the probability distributions of all considered events – results in a fragment of the spectrum compatible with the spectrum of behavioral equivalences for fully probabilistic processes. In contrast, the second approach – which compares the probabilities of the events of a resolution with the probabilities of the same events in possibly different resolutions – gives rise to another fragment composed of coarser equivalences that exhibits several analogies with the spectrum of behavioral equivalences for fully nondeterministic processes. Finally, the third approach – which only compares the extremal probabilities of each event stemming from the different resolutions – yields even coarser equivalences that, however, give rise to a hierarchy similar to that stemming from the second approach.
منابع مشابه
A Companion of "Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities"
In the paper “Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities” to appear in Theoretical Computer Science, we present a comparison of behavioral equivalences for nondeterministic and probabilistic processes. In particular, we consider strong trace, failure, testing, and bisimulation equivalences. For each of these groups of equivalences, we examine the...
متن کاملAxiomatizations for Probabilistic Finite-State Behaviors
We study a process calculus which combines both nondeterministic and probabilistic behavior in the style of Segala and Lynch’s probabilistic automata. We consider various strong and weak behavioral equivalences, and we provide complete axiomatizations for finite-state processes, restricted to guarded definitions in case of the weak equivalences. We conjecture that in the general case of unguard...
متن کاملRelating strong behavioral equivalences for processes with nondeterminism and probabilities
We present a comparison of behavioral equivalences for nondeterministic and probabilistic processes whose activities are all observable. In particular, we consider trace-based, testing, and bisimulation-based equivalences. For each of them, we examine the discriminating power of three variants stemming from three approaches that differ for the way probabilities of events are compared when nonde...
متن کاملA uniform framework for modeling nondeterministic, probabilistic, stochastic, or mixed processes and their behavioral equivalences
Labeled transition systems are typically used as behavioral models of concurrent processes. Their labeled transitions define a one-step state-to-state reachability relation. This model can be generalized by modifying the transition relation to associate a state reachability distribution with any pair consisting of a source state and a transition label. The state reachability distribution is a f...
متن کاملRevisiting Trace and Testing Equivalences for Nondeterministic and Probabilistic Processes
One of the most studied extensions of testing theory to nondeterministic and probabilistic processes yields unrealistic probabilities estimations that give rise to two anomalies. First, probabilistic testing equivalence does not imply probabilistic trace equivalence. Second, probabilistic testing equivalence differentiates processes that perform the same sequence of actions with the same probab...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013